Multi-source spanning trees: algorithms for minimizing source eccentricities

Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics

We consider generalizations of the k-source sum of vertex eccentricity problem (k-SVET) and the k-source sum of source eccentricity problem (k-SSET) [1], which we call SDET and SSET, respectively, and provide efficient algorithms for their solution. The SDET (SSET, resp.) problem is defined as follows: given a weighted graph G and sets S of source nodes and D of destination nodes, which are sub...

The complexity of minimizing certain cost metrics for k-source spanning trees

We investigate multi-source spanning tree problems where, given a graph with edge weights and a subset of the nodes defined as sources, the object is to find a spanning tree of the graph that minimizes some distance related cost metric. This problem can be used to model multicasting in a network where messages are sent from a fixed collection of senders and communication takes place along the e...

Multi - Source Spanning Tree Problemsarthur

Multi-Source Spanning Tree Problems

We consider a model of communication in a network, where multiple sources have messages to disseminate among the network membership. We propose that all the messages (one from each source) be disseminated along the same spanning tree of the network and consider the problem of constructing such a tree. One evaluative measure for suitability of the construction is the sum of distances from each s...

Single-Source Dilation-Bounded Minimum Spanning Trees

Given a set S of points in the plane, a geometric network for S is a graph G with vertex set S and straight edges. We consider a broadcasting situation, where one point r ∈ S is a designated source. Given a dilation factor δ, we ask for a geometric network G such that for every point v ∈ S there is a path from r to v in G of length at most δ|rv|, and such that the total edge length is minimized...